/*
 ID: bqi3431
 PROG: lostcows
 LANG: C++11
 */

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace io {
    // TYPE ID (StackOverflow)
    
    template<class T> struct like_array : is_array<T>{};
    template<class T, size_t N> struct like_array<array<T,N>> : true_type{};
    template<class T> struct like_array<vector<T>> : true_type{};
    template<class T> bool is_like_array(const T& a) { return like_array<T>::value; }
    
    // I/O
    
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0);
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); }
    }
    
    // INPUT
    
    template<class T> void re(T& x) { cin >> x; }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest);
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { re(first); re(rest...); }
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
    
    // OUTPUT
    
    template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) {
        os << '{' << a.f << ", " << a.s << '}'; return os;
    }
    template<class T> ostream& printArray(ostream& os, const T& a, int SZ) {
        os << '{';
        F0R(i,SZ) {
            if (i) {
                os << ", ";
                if (is_like_array(a[i])) cout << "\n";
            }
            os << a[i];
        }
        os << '}';
        return os;
    }
    template<class T> ostream& operator<<(ostream& os, const vector<T>& a) {
        return printArray(os,a,sz(a));
    }
    template<class T, size_t SZ> ostream& operator<<(ostream& os, const array<T,SZ>& a) {
        return printArray(os,a,SZ);
    }
    
    template<class T> void pr(const T& x) { cout << x << '\n'; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        cout << first << ' '; pr(rest...);
    }
}

using namespace io;

int N,M,nex[201][201];
pi dist[201][201];
pi DIST[201];
vi radj[201][201];
queue<pi> q;
queue<int> Q;

int main() {
    // you should actually read the stuff at the bottom
    setIO("lostcows");
    re(N,M);
    FOR(i,1,N+1) {
        FOR(j,1,N+1) dist[i][j] = {MOD,MOD};
        dist[i][i].f = 0; q.push({i,i});
    }
    FOR(j,1,M+1) FOR(i,1,N+1) {
        int a; re(a);
        nex[i][j] = a;
        radj[a][j].pb(i);
    }
    while (sz(q)) {
        auto a = q.front(); q.pop();
        FOR(j,1,M+1) trav(x,radj[a.f][j]) trav(y,radj[a.s][j])
        if (dist[x][y].f == MOD) {
            dist[x][y] = {dist[a.f][a.s].f+1,j};
            q.push({x,y});
        }
    }
    // FOR(i,1,N+1) FOR(j,1,N+1) assert(dist[i][j].f != MOD);
    vi cur; FOR(i,1,N+1) cur.pb(i);
    while (sz(cur) > 1) {
        int x = cur[sz(cur)-2], y = cur[sz(cur)-1];
        while (dist[x][y].f) {
            int t = dist[x][y].s; pr(t);
            trav(z,cur) z = nex[z][t];
            x = nex[x][t], y = nex[y][t];
        }
        sort(all(cur)); cur.erase(unique(all(cur)),cur.end());
    }
    FOR(i,1,N+1) DIST[i] = {MOD,MOD};
    Q.push(1); DIST[1].f = 0;
    while (sz(Q)) {
        auto a = Q.front(); Q.pop();
        FOR(j,1,M+1) trav(x,radj[a][j]) if (DIST[x].f == MOD) {
            DIST[x] = {DIST[a].f+1,j};
            Q.push(x);
        }
    }
    // exit(0);
    while (cur[0] != 1) {
        pr(DIST[cur[0]].s);
        cur[0] = nex[cur[0]][DIST[cur[0]].s];
    }
    // pr(cur);
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?), set tle
 * do smth instead of nothing and stay organized
 */

